Combining Akaike’s Information Criterion (AIC) and the Golden-Section Search Technique to find Optimal Numbers of K-Nearest Neighbors
نویسندگان
چکیده
منابع مشابه
Combining Akaike’s Information Criterion (AIC) and the Golden-Section Search Technique to find Optimal Numbers of K-Nearest Neighbors
K-nearest neighbor (KNN) is one of the accepted classification tool . Classfication is one of the foremost machine-learning tools used in field of medical data mining. However, one of the most complicated tasks in developing a KNN is determining the optimal number of nearest neighbors, which is usually obtained by repeated experiments for different values of K, till the minimum error rate is ac...
متن کاملSearch K Nearest Neighbors on Air
While the K-Nearest-Neighbor (KNN) problem is well studied in the traditional wired, disk-based client-server environment, it has not been tackled in a wireless broadcast environment. In this paper, the problem of organizing location dependent data and answering KNN queries on air are investigated. The linear property of wireless broadcast media and power conserving requirement of mobile device...
متن کاملBrute-Force k-Nearest Neighbors Search on the GPU
We present a brute-force approach for finding k-nearest neighbors on the GPU for many queries in parallel. Our program takes advantage of recent advances in fundamental GPU computing primitives. We modify a matrix multiplication subroutine in MAGMA library [6] to calculate the squared Euclidean distances between queries and references. The nearest neighbors selection is accomplished by a trunca...
متن کاملk*-Nearest Neighbors: From Global to Local
The weighted k-nearest neighbors algorithm is one of the most fundamental nonparametric methods in pattern recognition and machine learning. The question of setting the optimal number of neighbors as well as the optimal weights has received much attention throughout the years, nevertheless this problem seems to have remained unsettled. In this paper we offer a simple approach to locally weighte...
متن کاملA Simple Heuristic to Find Efficiently k-Nearest Neighbors in Flocking Behaviors
Flocking behaviors are used in games and computer graphics for realistic simulation of massive crowds. Simulation of massive crowds in real time is a computationally intensive task. This intensity mostly comes from the O(n 2 ) complexity of the traversal algorithm. It is because each agent in crowd has to decide for itself which neighbors fall into its environment. There are several algorithms ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2010
ISSN: 0975-8887
DOI: 10.5120/609-859